Fleet routing and scheduling problem based on constraints of chance

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

Solving Fleet Scheduling Problem using Metaheuristic Algorithms

Mixed Integer Programming Model for Split Delivery Vehicle Routing Problem with Fleet and Driver Scheduling

Vehicle Routing Problem (VRP) is a key element of many transportation systems which involve routing of fleet of vehicles from a depot to a set of customers node. It is required that these vehicles return to the depot after serving customers’ demand. This paper investigates a relaxed version of VRP, in which the number of visits to the customer is not restricted to be at most one. The relaxed ve...

On the Technician Routing and Scheduling Problem

The technician routing and scheduling problem consists in routing and scheduling a crew of technicians in order to attend a set of service requests, subject to skill, tool, and spare part constraints. In this study we propose a formal definition of the problem and present a constructive heuristic and a large neighborhood search optimization algorithm.

Fleet assignment and routing with schedule synchronization constraints

This paper introduces a new type of constraints, related to schedule synchronization, in the problem formulation of aircraft ̄eet assignment and routing problems and it proposes an optimal solution approach. This approach is based on Dantzig±Wolfe decomposition/column generation. The resulting master problem consists of ̄ight covering constraints, as in usual applications, and of schedule synch...